Interval 0-1 Programming Problem and Product-Mix Analysis
نویسندگان
چکیده
منابع مشابه
Solving product mix problem in multiple constraints environment using goal programming
The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملDNA Computing Model of the 0-1 Programming Problem
DNA computing aims at using nucleic acids for computing. Since micromolar DNA solutions can act as billions of parallel nanoprocessors, DNA computers can in theory solve optimization problems that require vast search spaces. However, the actual parallelism currently being achieved is at least a hundred million-fold lower than the number of DNA molecules used. This is due to the quantity of DNA ...
متن کاملReframing the Product Mix Problem using the Theory of Constraints
This paper builds on prior work examining pedagogical strategies for the teaching of OR/MS. In particular, the authors focus on the use of framing as a pedagogical metaframework and extend the repertoire of frames in use presented elsewhere. The purpose of framing and reframing is to improve the understanding of problems and problematic situations by providing a means of developing and synthesi...
متن کاملClasses of Interval Digraphs and 0 , 1 -
We consider a hierarchy of four classes of interval digraphs, or equivalently four classes of 0,1-matrics. We provide forbidden submatrix characterizations separating the successive classes. The largest class is the set of (adjacency matrices of) interval digraphs; the smallest is the set of (adjacency matrices of) unit interval digraphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1989
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.32.352